Cell Loss Asymptotics in Buffers Fed by Heterogeneous Longtailed Sources
نویسندگان
چکیده
In this paper we consider a generalization of the so-called M=G=1 model where M types of long-tailed sessions enter a buffer . The instantaneous rates of the sessions are functions of the occupancy of an M=G=1 system with long-tailed G distributions. In particular we assume that a session of type i transmits ri cells per unit time and lasts for a random time with long tailed distribution given by P ( > x) ix (1+ i) where i > 0. We derive the mean cell loss asymptotics for large buffer size as well as the complementary distribution of the buffer occupancy exceeding a high level. When specialized to the homogeneous case we show that recent results on large buffer asymptotics, which have been shown under more restrictive assumptions, hold under more generally . In the heterogeneous case, we show that the asymptotics are not necessarily governed by the sources with the smallest i but also depend on the rates ri and it is the ratio of i to ri which is important. Finally it is a simple observation that light-tailed (exponential tails for example) sources have no influence on the asymptotics except that they contribute to reducing the capacity available to heavy tailed sources by their mean load.
منابع مشابه
Asymptotic analysis of GPS systems fed by heterogeneous long-tailed sources
In this paper we consider a multi-buffered system consisting of N buffers accessed by heterogeneous longtailed sessions and served according to the Generalized Processor Sharing (GPS) discipline with weights f ig. We assume that sessions arrive according to a Poisson process. A session of type i transmits at rate ri and has a duration whose distribution is longtailed of the form P ( i > t) it (...
متن کاملMany Sources Asymptotics for a Feedforward Network with Small Buffers
In this paper we obtain the logarithmic asymptotics in a network of small buffers when the resources are accessed by a large number of stationary independent sources. Under the assumption that the network is feedforward with respect to source-destination pairs we identify the precise large deviations rate functions at each node in terms of the external input characteristics. Using these results...
متن کاملOverflow Behavior in Queues with Many Long-Tailed Inputs
We consider a fluid queue fed by a superposition of n homogeneous on-off sources with generally distributed onand off-periods. We scale buffer space B and link rate C by n, such that we get nb and nc, respectively. Then we let n grow large. In this regime, the overflow probability decays exponentially in the number of sources n; we specifically examine the situation in which also b is large. We...
متن کاملCongestion control for ATM multiplexers using neural networks: multiple sources/single buffer scenario.
A new neural network based method for solving the problem of congestion control arising at the user network interface (UNI) of ATM networks is proposed in this paper. Unlike the previous methods where the coding rate for all traffic sources as controller output signals is tuned in a body, the proposed method adjusts the coding rate for only a part of the traffic sources while the remainder sour...
متن کاملWhy buffers in switching systems do not essentially improve QoS: An analytical case study for On-Off source traffic
Traffic models with a rate varying according to a Gaussian distribution are commonly used to evaluate statistical multiplexing in telecommunication systems. The superposition of a sufficient large number of homogeneous Markovian On-Off sources asymptotically approaches an Ornstein-Uhlenbeck process (OUP) which represents a Gaussian process with exponential autocorrelation function. We derive a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000